A Seed - Growth Heuristic
نویسندگان
چکیده
We present a new heuristic algorithm for graph bisection, based on an implicit notion of clustering. We describe how the heuristic can be combined with stochastic search procedures and a postprocess application of the Kernighan-Lin algorithm. In a series of time-equated comparisons with large-sample runs of pure Kernighan-Lin, the new algorithm demonstrates signiicant superiority in terms of the best bisections found.
منابع مشابه
Cognate Mapping - A Heuristic Strategy for the Semi-Supervised Acquisition of a Spanish Lexicon from a Portuguese Seed Lexicon
We deal with the automated acquisition of a Spanish medical subword lexicon from an already existing Portuguese seed lexicon. Using two non-parallel monolingual corpora we determined Spanish lexeme candidates from Portuguese seed lexicon entries by heuristic cognate mapping. We validated the emergent lexical translation hypotheses by determining the similarity of fixed-window context vectors on...
متن کاملEffects of seed aging on subsequent seed reserve utilization and seedling growth in soybean
Reduced seedling growth is a consequence of seed deterioration. The heterotrophic seedling growth can be considered as the product of three components: (1) initial seed weight, (2) the fraction of seed reserves which are mobilized, and (3) the conversion efficiency of mobilized seed reserves to seedling tissues. It is not clear which of these component (s) is affected by seed deterioration. To ...
متن کاملSemi-Supervised Acquisition of a Spanish Lexicon from a Portuguese Seed Lexicon
This paper deals with the automated acquisition of a Spanish medical subword lexicon from an already existing Portuguese seed lexicon. Using two nonparallel monolingual corpora we determine Spanish lexeme candidates from Portuguese seed lexicon entries by heuristic cognate mapping. We are still working on the experiments and trying to achieve a good method for validating the translation hypothe...
متن کاملSeed-growth Heuristics for Graph Bisection
We investigate a family of algorithms for graph bisection that are based on a simple local connectivity heuristic, which we call seedgrowth. We show how the heuristic can be combined with stochastic search procedures and a postprocess application of the KernighanLin algorithm. In a series of time-equated comparisons against largesample runs of pure Kernighan-Lin, the new algorithms nd bisection...
متن کاملRandomness in Cryptography April 11 , 2013 Lecture 13 : Seed - Dependent Key Derivation
In today’s lecture, we study seeded key-derivation functions (KDFs) in the setting where the source of weak randomness X is dependent on the seed S, and we give two approaches to constructing KDFs in this setting. Then, we generalize the setting to one in which the attacker is given some additional “side information” that depends on X and S; we define a notion of condensers that are secure in t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998